Mathematical models for real-world production planning problems with sequence-dependent set-up costs

نویسندگان

  • Xueying Shen
  • Filippo Focacci
  • Fabio Furini
  • Virginie Gabrel
  • Daniel Godard
چکیده

Production Planning (PP) aims at making production decisions optimizing the Manufacturing and Supply Chain performances. Given a limited amount of manufacturing resources, raw materials, and inventory space, PP minimizes the overall manufacturing and supply chain costs while meeting service level requirements and obeying operational constraints. In this research we focus on the sequencedependent set-up costs which occur when we change a product production during manufacturing. In real-world manufacturing, this cost typically depends on both the predecessor and current production. The set-up costs are also called clean-up costs, changeover costs or start-up costs (in the literature). These costs are one important part of the production costs for many real-world production systems. The set-up costs optimization may dramatically affect the quality of the production plans in terms of machine operational efficiency, cycle time, service level and inventory turns. Finally, different levels of details are typically taken into consideration which largely affect the complexity of the resulting models. In this work, we study a real-world PP problem with sequence-dependent set-up costs and we propose different formulations with different levels of details of the operational constraints.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Flow shop Production Planning Problem with basic period policy and Sequence Dependent set up times

Many authors have examined lot sizing, scheduling and sequence of multi-product flow shops, but most of them have assumed that set up times are independent of sequence. Whereas dependence of set up times to sequence is more common in practice. Hence, in this paper, we examine the discussed problem with hypothesis of dependence of set up times to sequence and cyclic schedule policy in basic peri...

متن کامل

A fuzzy mixed-integer goal programming model for a parallel machine scheduling problem with sequence-dependent setup times and release dates

This paper presents a new mixed-integer goal programming (MIGP) model for a parallel machine scheduling problem with sequence-dependent setup times and release dates. Two objectives are considered in the model to minimize the total weighted flow time and the total weighted tardiness simultaneously. Due to the com-plexity of the above model and uncertainty involved in real-world scheduling probl...

متن کامل

GENETIC AND TABU SEARCH ALGORITHMS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH SEQUENCE-DEPENDENT SET-UP TIMES AND DETERIORATING JOBS

 This paper introduces the effects of job deterioration and sequence dependent set- up time in a single machine scheduling problem. The considered optimization criterion is the minimization of the makespan (Cmax). For this purpose, after formulating the mathematical model, genetic and tabu search algorithms were developed for the problem. Since population diversity is a very important issue in ...

متن کامل

A Chance Constrained Integer Programming Model for Open Pit Long-Term Production Planning

The mine production planning defines a sequence of block extraction to obtain the highest NPV under a number of constraints. Mathematical programming has become a widespread approach to optimize production planning, for open pit mines since the 1960s. However, the previous and existing models are found to be limited in their ability to explicitly incorporate the ore grade uncertainty into the p...

متن کامل

Minimizing the maximum tardiness and makespan criteria in a job shop scheduling problem with sequence dependent setup times

The job shop scheduling problem (JSP) is one of the most difficult problems in traditional scheduling because any job consists of a set operations and also any operation processes by a machine. Whereas the operation is placed in the machine, it is essential to be considering setup times that the times strongly depend on the various sequencing of jobs on the machines. This research is developed ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014